A Low-Dimensional Representation for Robust Partial Isometric Correspondences Computation
نویسندگان
چکیده
Intrinsic shape matching has become the standard approach for pose invariant correspondence estimation among deformable shapes. Most existing approaches assume global consistency. While global isometric matching is well understood, only a few heuristic solutions are known for partial matching. Partial matching is particularly important for robustness to topological noise, which is a common problem in real-world scanner data. We introduce a new approach to partial isometric matching based on the observation that isometries are fully determined by local information: a map of a single point and its tangent space fixes an isometry. We develop a new representation for partial isometric maps based on equivalence classes of correspondences between pairs of points and their tangent-spaces. We apply our approach to register partial point clouds and compare it to the state-of-the-art methods, where we obtain significant improvements over global methods for real-world data and stronger guarantees than previous partial matching algorithms.
منابع مشابه
Efficient Computation of Scale-Space Features for Deformable Shape Correspondences
With the rapid development of fast data acquisition techniques, 3D scans that record the geometric and photometric information of deformable objects are routinely acquired nowadays. To track surfaces in temporal domain or stitch partially-overlapping scans to form a complete model in spatial domain, robust and efficient feature detection for deformable shape correspondences, as an enabling meth...
متن کاملCorrespondences of Persistent Feature Points on Near-Isometric Surfaces
We present a full pipeline for finding corresponding points between two surfaces based on conceptually simple and computationally efficient components. Our pipeline begins with robust and stable extraction of feature points from the surfaces. We then find a set of near isometric correspondences between the feature points by solving an optimization problem using established components. The perfo...
متن کاملOn the canonical metric representation of graphs and partial Hamming graphs
Average distance of a graph is bounded in terms of its canonical metric representation. The inequality in particular yields a characterization of isometric subgraphs of Hamming graphs which in turn simplifies recognition of these graphs and computation of average distance.
متن کاملAn improved incremental nonlinear dimensionality reduction for isometric data embedding
a r t i c l e i n f o a b s t r a c t Manifold learning has become a hot issue in the field of machine learning and data mining. There are some algorithms proposed to extract the intrinsic characteristics of different type of high-dimensional data by performing nonlinear dimensionality reduction, such as ISOMAP, LLE and so on. Most of these algorithms operate in a batch mode and cannot be effec...
متن کاملOn the canonical metric representation, average distance, and partial Hamming graphs
Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometric subgraphs of Hamming graphs. This approach simplifies recognition of these graphs and computation of their average distance. © 2004 Elsevier Ltd. All rights reserved. MSC: 05C12; 05C75; 05C85
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphical Models
دوره 76 شماره
صفحات -
تاریخ انتشار 2014